Perfect state transfer of a qudit over underlying networks of group association schemes

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Perfect state transfer of a qudit over underlying networks of group association schemes

As generalizations of results of Christandl et al.[1, 2] and Facer et al.[3], Bernasconi et al.[4, 5] studied perfect state transfer (PST) between two particles in quantum networks modeled by a large class of cubelike graphs (e.g., the hypercube) which are the Cayley graphs of the elementary abelian group Zn 2 . In Refs. [6, 7], respectively, PST of a qubit over distance regular spin networks a...

متن کامل

Perfect state transfer over distance-regular spin networks

By considering distance-regular graphs as spin networks, first we introduce some particular spin Hamiltonians which are extended version of those of Refs.[1, 2]. Then, by using spectral analysis techniques and algebraic combinatoric structure of distanceregular graphs such as stratification introduced in [3, 4] and Bose-Mesner algebra, we give a method for finding a set of coupling constants in...

متن کامل

perfect state transfer in unitary cayley graphs over local rings

in this work, using eigenvalues and eigenvectors of unitary cayley graphs over finite local rings and elementary linear algebra, we characterize which local rings allowing pst occurring in its unitary cayley graph. moreover, we have some developments when $r$ is a product of local rings.

متن کامل

Perfect state transfer in quantum spin networks.

We propose a class of qubit networks that admit the perfect state transfer of any quantum state in a fixed period of time. Unlike many other schemes for quantum computation and communication, these networks do not require qubit couplings to be switched on and off. When restricted to N-qubit spin networks of identical qubit couplings, we show that 2log3N is the maximal perfect communication dist...

متن کامل

Calculating effective resistances on underlying networks of association schemes

Recently, in Refs. [1] and [2], calculation of effective resistances on distance-regular networks was investigated, where in the first paper, the calculation was based on stratification and Stieltjes function associated with the network, whereas in the latter one a recursive formula for effective resistances was given based on the Christoffel-Darboux identity. In this paper, evaluation of effec...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Statistical Mechanics: Theory and Experiment

سال: 2009

ISSN: 1742-5468

DOI: 10.1088/1742-5468/2009/04/p04004